R-Calculus: An Inference System for Belief Revision

نویسنده

  • Wei Li
چکیده

First-order languages have been introduced to describe beliefs formally and the concept of revision is defined for model as well as proof. A logical inference system named R-calculus is defined to derive all maximal contractions of a base of belief set for its given refutations. The R-calculus consists of the structural rules, an axiom, a cut rule and the rules for logical connectives and quantifiers. Some examples are given to demonstrate how to use the R-calculus. Furthermore, the properties reachability, soundness and completeness of the R-calculus are formally defined and proved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Game Semantics for System P (Extended Version)

In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...

متن کامل

The Sound and Complete R-Calculi with Respect to Pseudo-Revision and Pre-Revision

The AGM postulates ([1]) are for the belief revision (revision by a single belief), and the DP postulates ([2]) are for the iterated revision (revision by a finite sequence of beliefs). Li [3] gave an R-calculus for R-configurations ,   where Δ is a set of literals, and Γ is a finite set of formulas. We shall give two -calculi such that for any consistent set Γ and finite consistent set of fo...

متن کامل

A Game Semantics for System P

In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...

متن کامل

Knowledge without Modality: A Simplified Framework for Chronological Ignorance

p. 1 Knowledge Without Modality: A Simplified Framework for Chronological Ignorance p. 25 Design Complete Sequential Calculus for Continuous Fixpoint Temporal Logic p. 36 Logical Omniscience and Classical Logic p. 52 Weak Implication: Theory and Applications p. 65 Deriving Inference Rules for Terminological Logics p. 84 Linear Proofs and Linear Logic p. 106 Relevance and Revision About Generali...

متن کامل

Nonmonotonic Reasoning and Multiple Belief Revision

The aim of the present paper is to reveal the interrelation between general patterns of nonmonotonic reasoning and multiple belief revision. For this purpose we de ne a nonmonotonic inference frame in which individual inference rules have been proposed in the literature but their combination as a system has not been investigated. It is shown that such a system is so strong that almost all the r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2007